On postulate-sets for Newman algebra and Boolean algebra, I
نویسندگان
چکیده
منابع مشابه
Postulate-sets for Boolean Rings
1. Introduction. Boolean rings (or generalized Boolean algebras), defined by Stone, are rings in which every element is idempotent. Sets of postulates for these rings have been given by Stone(2) and by Stabler(8). I give in this paper a number of additional postulate-sets for such rings. The sets are all expressed in terms of ring addition and multiplication. Stone's postulates for Boolean ring...
متن کاملOn instruction sets for Boolean registers in program algebra
In program algebra, different instruction sets for Boolean registers are conceivable. In previous work on instruction sequence size complexity, we chose instruction sets for Boolean registers that contain only a few of the possible instructions. In the current paper, we study instruction sequence size bounded functional completeness of instruction sets for Boolean registers. This work is among ...
متن کاملSingle Axioms for Boolean Algebra
Explicit single axioms are presented for Boolean algebra in terms of (1) the Sheffer stroke; (2) disjunction and negation; (3) disjunction, conjunction, and negation; and (4) disjunction, conjunction, negation, 0, and 1. It was previously known that single axioms exist for these systems, but the procedures to generate them are exponential, producing huge equations. Automated deduction technique...
متن کاملBoolean Algebra Approximations
Knight and Stob proved that every low4 Boolean algebra is 0-isomorphic to a computable one. Furthermore, for n = 1, 2, 3, 4, every lown Boolean algebra is 0-isomorphic to a computable one. We show that this is not true for n = 5: there is a low5 Boolean algebra that is not 0-isomorphic to any computable Boolean algebra. It is worth remarking that, because of the machinery developed, the proof u...
متن کاملIntroducing Interpolative Boolean algebra into Intuitionistic fuzzy sets
In this paper, we introduce Interpolative Boolean algebra (IBA) as a suitable algebra for intuitionistic fuzzy sets (IFSs). IBA is [0,1]-valued realization of Boolean algebra, consistent with Boolean axioms and theorems. IFS theory takes into account both membership and non-membership function, so it can be viewed as a generalization of the traditional fuzzy set theory. We propose a realization...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the Japan Academy, Series A, Mathematical Sciences
سال: 1964
ISSN: 0386-2194
DOI: 10.3792/pja/1195522838